Solution algorithms for single-machine scheduling with learning effects and exponential past-sequence-dependent delivery times

This paper addresses the single-machine scheduling problem with learning effects and exponential past-sequence-dependent delivery times. The objective is to determine an optimal job schedule such that total weighted completion time maximum tardiness are minimized. To solve general case of problem, we propose heuristic, simulated annealing branch-and-bound algorithms. computational experiment also conducted show algorithms perform effectively.